Security Concern and Countermeasures for Cheating in Visual Cryptography
نویسندگان
چکیده
منابع مشابه
Survey of Cheating Prevention Techniques in Visual Cryptography
Visual cryptography (VC) is a technique of encoding a secret image into share images such that stacking a sufficient number of shares reveals the original secret image. Shares are generally presented in transparencies. So each participant holds a transparency. The original secret image is recovered after superimposing the transparencies one to other. Basically, the performance of visual cryptog...
متن کاملShare Authentication based Cheating Prevention in Naor-Shamir’s Visual Cryptography
Visual cryptography (VC), first proposed by Naor and Shamir, is a variant of secret sharing with many applications, such as providing secure services in communications. In 2006, Horng et al. showed that VC is vulnerable to cheating attacks. They also presented two approaches to prevent cheating, namely share authentication and blind authentication. In this paper, we review some share authentica...
متن کاملA Novel Scheme for Mutual Authentication and Cheating Prevention in Visual Cryptography using Image Processing
Visual cryptography (VC) is a method of encrypting a secret image into shares such that stacking a sufficient number of shares reveals the secret image. Shares are usually presented in transparencies. Each participant holds a transparency. In this paper, we studied the cheating problem in VC by malicious adversaries. We considered the attacks of malicious adversaries who may deviate from the sc...
متن کاملCountermeasures for mobile agent security
Security is an important issue for the widespread deployment of applications based on software agent technology. It is generally agreed that without the proper countermeasures in place, use of agent-based applications will be severely impeded. However, not all applications require the same set of countermeasures, nor can they depend entirely on the agent system to provide them. Instead, counter...
متن کاملA new deterministic algorithm based cheating prevention scheme for Visual Cryptography
In 1995, Naor and Shamir proposed the k-out-of-n Visual Cryptography scheme such that only more than or equal to k participants can visually recover the secret through superimposing their transparencies. In 2006, Horng et al. indicated that cheating is possible when some participants create forged transparencies to deceive the remaining participants. In 2007, Tsai et al. proposed another cheati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Emerging Research in Management and Technology
سال: 2018
ISSN: 2278-9359
DOI: 10.23956/ijermt.v6i8.152